A chain theorem for 4-connected graphs
نویسندگان
چکیده
منابع مشابه
A Chain Theorem for 3+-Connected Graphs
4 A 3-connected graph is 3-connected if it has no 3-separation that separates a “large” fan or K3,n 5 from the rest of the graph. It is proved in this paper that, except for K4, every 3 -connected graph has 6 a 3-connected proper minor that is at most two edges away from the original graph. This result is used 7 to characterize Q-minor-free graphs, where Q is obtained from the Cube by contracti...
متن کاملA chain theorem for 4-connected matroids
A matroid M is said to be k–connected up to separators of size l if whenever A is (k − 1)–separating in M , then either |A| ≤ l or |E(M)− A| ≤ l. We use si(M) and co(M) to denote the simplification and cosimplification of the matroid M . We prove that if a 3–connected matroid M is 4–connected up to separators of size 5, then there is an element x of M such that either co(M\x) or si(M/x) is 3–co...
متن کاملA chain theorem for internally 4-connected binary matroids
Let M be a matroid. When M is 3-connected, Tutte’s WheelsandWhirls Theorem proves that M has a 3-connected proper minor N with exactly one element fewer than M unless M is a wheel or a whirl. I will present a corresponding result for internally 4-connected binary matroids. This presentation is based on joint work by myself, Dillon Mayhew, and James Oxley.
متن کاملChain Decompositions of 4-Connected Graphs
In this paper we give a decomposition of a 4-connected graph G into nonseparating chains, which is similar to an ear decomposition of a 2-connected graph. We also give an O(|V (G)||E(G)|) algorithm that constructs such a decomposition. In applications, the asymptotic performance can often be improved to O(|V (G)|). This decomposition will be used to find four independent spanning trees in a 4co...
متن کاملA Separation Theorem for Chain Event Graphs
Bayesian Networks (BNs) are popular graphical models for the representation of statistical problems embodying dependence relationships between a number of variables. Much of this popularity is due to the d-separation theorem of Pearl and Lauritzen, which allows an analyst to identify the conditional independence statements that a model of the problem embodies using only the topology of the grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2019
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2018.07.005